منابع مشابه
Minimal 2-dominating sets in trees
We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.
متن کاملMinimal Double Dominating Sets in Trees
We provide an algorithm for listing all minimal double dominating sets of a tree of order n in time O(1.3248). This implies that every tree has at most 1.3248 minimal double dominating sets. We also show that this bound is tight.
متن کاملLocating and total dominating sets in trees
Locating and Total Dominating Sets in Trees by Jamie Marie Howard A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
متن کاملCohabitation of Independent Sets and Dominating Sets in Trees
We give a constructive characterization of trees that have a maximum independent set and a minimum dominating set which are disjoint and show that the corresponding decision problem is NP-complete for general graphs.
متن کاملTrees having many minimal dominating sets
We disprove a conjecture by Skupień that every tree of order n has at most 2 minimal dominating sets. We construct a family of trees of both parities of the order for which the number of minimal dominating sets exceeds 1.4167. We also provide an algorithm for listing all minimal dominating sets of a tree in time O(1.4656). This implies that every tree has at most 1.4656 minimal dominating sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.07.038